Improved polynomial remainder sequences for Ore polynomials
نویسندگان
چکیده
منابع مشابه
Various New Methods for Computing Subresultant Polynomial Remainder Sequences (PRS’s)
Teaching subresultant prs’s is an unpleasant experience because there is a misunderstanding about the role of Sylvester’s two matrices and how they affect the signs of the sequences. Almost all articles and texts on the subject perform operations in Z[x] and use a form of pseudo-division that distorts the signs of the polynomial remainders; hence, sentences like “forget about the signs” appear ...
متن کاملMatrix computation of subresultant polynomial remainder sequences in integral domains
We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest comnum divi~w of two polynomials A and B (of degrees m and n, respectively) along with their polynomial remainder ~quence. It is impr~wed in the sense that we obtain complete theoretical results, independent {}f Van Vleck's theorem [13] (which is not always tnle [2, 6]),...
متن کاملOn Polynomial Remainder Codes
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding ...
متن کاملOre Polynomials in Sage
We present a Sage implementation of Ore algebras. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing; desingularization; solvers for polynomials, rational functions and (generalized) power series. This paper is a tutorial on how to use the package.
متن کاملModular Computation for Matrices of Ore Polynomials
We give a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t]. Both the transformation matrix and the transformed matrix are computed. The algorithm can be used for finding the rank and left nullspace of such matrices. In the special case of shift polynomials, we obtain algorithms for computing a weak Popov form and for computing a greatest common...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2013
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2013.05.012